A digraph has a Hamiltonian circuit if there exists
a sequence of arcs that traverses the diagraph in such a way that each vertex is visited exactly once before returning to the starting point.